umi-top / umi-core-js

 * @license

 * Copyright (c) 2020 UMI

 *

 * Permission is hereby granted, free of charge, to any person obtaining a copy

 * of this software and associated documentation files (the "Software"), to deal

 * in the Software without restriction, including without limitation the rights

 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell

 * copies of the Software, and to permit persons to whom the Software is

 * furnished to do so, subject to the following conditions:

 *

 * The above copyright notice and this permission notice shall be included in all

 * copies or substantial portions of the Software.

 *

 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR

 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,

 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE

 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER

 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,

 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE

 * SOFTWARE.

 */

'use strict'

const array = require('./array.js')

const converter = require('./converter.js')

const bech32Alphabet = 'qpzry9x8gf2tvdw0s3jn54khce6mua7l'

/**

 * @param {number[]} bytes

 * @returns {string}

 * @private

 */

function bech32Encode (bytes) {

  const prefix = converter.versionToPrefix((bytes[0] << 8) + bytes[1])

  const data = convert8to5(bytes.slice(2))

  const checksum = createChecksum(prefix, data)

  return prefix + '1' + data + checksum

}

/**

 * @param {string} bech32

 * @returns {number[]}

 * @private

 */

function bech32Decode (bech32) {

  if (bech32.length !== 62 && bech32.length !== 66) {

    throw new Error('bech32: invalid length')

  }

  const str = bech32.toLowerCase()

  const sepPos = str.lastIndexOf('1')

  if (sepPos === -1) {

    throw new Error('bech32: missing separator')

  }

  const pfx = str.slice(0, sepPos)

  const ver = converter.prefixToVersion(pfx)

  const data = str.slice(sepPos + 1)

  checkAlphabet(data)

  verifyChecksum(pfx, data)

  return array.arrayConcat(converter.uint16ToBytes(ver), convert5to8(data.slice(0, -6)))

}

/**

 * @param {string} data

 * @returns {number[]}

 * @private

 */

function convert5to8 (data) {

  let value = 0

  let bits = 0

  const bytes = strToBytes(data)

  const result = []

  for (let i = 0; i < bytes.length; i++) {

    value = (value << 5) | bytes[i]

    bits += 5

    while (bits >= 8) {

      bits -= 8

      result[result.length] = (value >> bits) & 0xff

    }

  }

    throw new Error('bech32: invalid data')

  }

  return result

}

/**

 * @param {number[]} data

 * @returns {string}

 * @private

 */

function convert8to5 (data) {

  let value = 0

  let bits = 0

  let result = ''

  for (let i = 0; i < data.length; i++) {

    value = (value << 8) | data[i]

    bits += 8

    while (bits >= 5) {

      bits -= 5

      result += bech32Alphabet.charAt((value >> bits) & 0x1f)

    }

  }

  /* istanbul ignore else */

  if (bits > 0) {

    result += bech32Alphabet.charAt((value << (5 - bits)) & 0x1f)

  }

  return result

}

/**

 * @param {string} prefix

 * @param {string} data

 * @returns {string}

 * @private

 */

function createChecksum (prefix, data) {

  const bytes = strToBytes(data)

  const pfx = prefixExpand(prefix)

  const values = array.arrayNew(pfx.length + bytes.length + 6)

  array.arraySet(values, pfx)

  array.arraySet(values, bytes, pfx.length)

  const poly = polyMod(values) ^ 1

  let checksum = ''

  for (let i = 0; i < 6; i++) {

    checksum += bech32Alphabet.charAt((poly >> 5 * (5 - i)) & 31)

  }

  return checksum

}

/**

 * @param {number[]} values

 * @returns {number}

 * @private

 */

 * @param {string} prefix

 * @returns {number[]}

 * @private

 */

function prefixExpand (prefix) {

  const res = array.arrayNew((prefix.length * 2) + 1)

  for (let i = 0, l = prefix.length; i < l; i++) {

    const ord = prefix.charCodeAt(i)

    res[i] = ord >> 5

    res[i + l + 1] = ord & 31

  }

  return res

}

/**

 * @param {string} str

 * @returns {number[]}

 * @private

 */

function strToBytes (str) {

  const bytes = []

  for (let i = 0, l = str.length; i < l; i++) {

    bytes[bytes.length] = bech32Alphabet.indexOf(str.charAt(i))

  }

  return bytes

}

/**

 * @param {string} prefix

 * @param {string} data

 * @private

 */

function verifyChecksum (prefix, data) {

  const pfx = prefixExpand(prefix)

  const bytes = strToBytes(data)

  const values = array.arrayNew(pfx.length + bytes.length)

  array.arraySet(values, pfx)

  array.arraySet(values, bytes, pfx.length)

  const poly = polyMod(values)

  if (poly !== 1) {

    throw new Error('bech32: invalid checksum')

  }

}

/**

 * @param {string} chars

 * @private

 */

function checkAlphabet (chars) {

  for (let i = 0, l = chars.length; i < l; i++) {

    if (bech32Alphabet.indexOf(chars.charAt(i)) === -1) {

      throw new Error('bech32: invalid character')

    }

  }

}

exports.bech32Decode = bech32Decode

exports.bech32Encode = bech32Encode